Completely positive matrices with a book-graph
نویسندگان
چکیده
منابع مشابه
Matrices with High Completely Positive Semidefinite Rank
A real symmetric matrix M is completely positive semidefinite if it admits a Gram representation by positive semidefinite matrices (of any size d). The smallest such d is called the completely positive semidefinite rank of M , and it is an open question whether there exists an upper bound on this number as a function of the matrix size. We show that if such an upper bound exists, it has to be a...
متن کاملCompletely positive mappings and mean matrices
Some functions f : R+ → R+ induce mean of positive numbers and the matrix monotonicity gives a possibility for means of positive definite matrices. Moreover, such a function f can define a linear mapping (JfD) −1 : Mn → Mn on matrices (which is basic in the constructions of monotone metrics). The present subject is to check the complete positivity of (JfD) −1 in the case of a few concrete funct...
متن کاملSeparating doubly nonnegative and completely positive matrices
The cone of Completely Positive (CP) matrices can be used to exactly formulate a variety of NP-Hard optimization problems. A tractable relaxation for CP matrices is provided by the cone of Doubly Nonnegative (DNN) matrices; that is, matrices that are both positive semidefinite and componentwise nonnegative. A natural problem in the optimization setting is then to separate a given DNN but non-CP...
متن کاملA note on “ 5 × 5 Completely positive matrices ”
In their paper “5×5 Completely positive matrices,” Berman and Xu [BX04] attempt to characterize which 5× 5 doubly nonnegative matrices are also completely positive. Most of the analysis in [BX04] concerns a doubly nonnegative matrix A that has at least one off-diagonal zero component. To handle the case where A is componentwise strictly positive, Berman and Xu utilize an “edge-deletion” transfo...
متن کاملCompletely Positive formulation of the Graph Isomorphism Problem
Given two graphs G1 and G2 on n vertices each, we define a graph G on vertex set V1 × V2 and the edge set as the union of edges of G1 × Ḡ2, Ḡ1 × G2, {(v, u ′), (v, u′′))(|u′, u′′ ∈ V2} for each v ∈ V1, and {((u′, v), (u′′, v))|u′, u′′ ∈ V1} for each v ∈ V2. We consider the completely-positive Lovász θ function, i.e., cpθ function for G. We show that the function evaluates to n whenever G1 and G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10070-2